Predicate transformer semantics

On the equivalence of state transformer semantics and predicate transformer semantics

G. Plotkin and the author [13] have worked out the equivalence between state transformer semantics and predicate transformer semantics in a domain theoretical setting for programs combining nondeterminism and probability. Works of C. Morgan and co-authors [20], Keimel, Rosenbusch and Streicher [14, 15], already go in the same direction using only discrete state spaces. In fact, Keimel and Plotk...

A Predicate Transformer Semantics for a Concurrent Language of Refinement

Circus is a combination of Z and CSP; its chief distinguishing feature is the inclusion of the ideas of the refinement calculus. Our main objective is the definition of refinement methods for concurrent programs. The original semantic model for Circus is Hoare and He’s unifying theories of programming. In this paper, we present an equivalent semantics based on predicate transformers. With this ...

A Predicate/State Transformer Semantics for Bayesian Learning

This paper establishes a link between Bayesian inference (learning) and predicate and state transformer operations from programming semantics and logic. Specifically, a very general definition of backward inference is given via first applying a predicate transformer and then conditioning. Analogously, forward inference involves first conditioning and then applying a state transformer. These def...

Predicate Transformer Semantics of a Higher Order Imperative Language With . . .

Relating State Transformation Semantics and Predicate Transformer Semantics for Parallel Programs

A state transformation semantics and a predicate transformer semantics for programs built from atomic actions, sequential composition, nondeterministic choice, parallel composition, atomisation, and recursion are presented. Both semantic models are derived from some SOS-style labelled transition system. The state transformation semantics and the predicate transformer semantics are shown to be i...